A Variable Depth Search Algorithm for Binary Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
A Hybrid Search Algorithm for Solving Constraint Satisfaction Problems
In this paper we present a hybrid search algorithm for solving constraint satisfaction and optimization problems. This algorithm combines ideas of two basic approaches: complete and incomplete algorithms which also known as systematic search and local search algorithms. Different characteristics of systematic search and local search methods are complementary. Therefore we have tried to get the ...
متن کاملA Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
The paper introduces a hybrid Tabu Search-Evolutionary Algorithm for solving the constraint satisfaction problem, called STLEA. Extensive experimental fine-tuning of parameters of the algorithm was performed to optimise the performance of the algorithm on a commonly used test-set. The performance of the STLEA was then compared to the best known evolutionary algorithm and benchmark deterministic...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملA non-binary constraint ordering heuristic for constraint satisfaction problems
Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables and values should to be considered. Choosing the right order of variables and values can noticeably improve the efficiency of constraint satisfaction. Furthermore, the order in which constraints are studied can improve efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/637809